翻訳と辞書 Words near each other ・ MN+ ・ MN-111 ・ MN-121 mine ・ MN-123 mine ・ MN-18 ・ MN1 ・ MN1 (gene) ・ MN103 ・ Mmeya ・ MMF ・ Mmfbm ・ MMFF ・ MMG ・ MMGN ・ MMH ・ MMH-Badger MAC ・ Mmhi ・ MMHL ・ Mmhmm ・ MMHS ・ MMHSS Thalassery ・ MMI ・ MMI Holdings Limited ・ MMI Preparatory School ・ Mmiata Anam ・ MMII (album) ・ MMIRSA ・ MMIS ・ MMIST CQ-10 Snowgoose ・ MMIX Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク MMH-Badger MAC ： ウィキペディア英語版 MMH-Badger MAC Badger is a Message Authentication Code (MAC) based on the idea of universal hashing and was developed by Boesgaard, Christensen, and Zenner. It is constructed by strengthening the ∆-universal hash family MMH using an ϵ-almost strongly universal (ASU) hash function family after the application of ENH (see below), where the value of ϵ is $1/(2^-5)$. Since Badger is a MAC function based on the universal hash function approach, the conditions needed for the security of Badger are the same as those for other universal hash functions such as UMAC. ==Introduction== The Badger MAC processes a message of length up to $2^-1$ bits and returns an authentication tag of length $u\backslash cdot32$ bits, where $1\backslash le\; u\; \backslash le\; 5$. According to the security needs, user can choose the value of $u$, that is the number of parallel hash trees in Badger. One can choose larger values of ''u'', but those values do not influence further the security of MAC. The algorithm uses a 128-bit key and the limited message length to be processed under this key is $2^$. The key setup has to be run only once per key in order to run the Badger algorithm under a given key, since the resulting internal state of the MAC can be saved to be used with any other message that will be processed later. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「MMH-Badger MAC」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.